package algorithm.advance;

public class GreedySYT {
	private static GreedySYT greedySYT = new GreedySYT();
	public static GreedySYT getInstance(){
		return greedySYT;
	}
	
	/*
	 * 
	 * 
	 A matroid is an ordered pair M={S,I}satisfying the following conditions
	 1. S is a finite set.
	 2.I is a nonempty family of subsets of S, called the independent subsets of S,such that if B ∈ I and  A ⊆ B , then A  ∈I  . We say that I is hereditary if it satisfies this property. Note that the empty set (O /); is necessarily a member of I.
	 3. If A ∈ I , B  ∈ I , and |A| < |B|, then there exists some element x ∈B-A such that A∪{x}∈ I. We say that M satisfies the exchange property.
	
	 private void greedy(M,w){
		 A = null;
		 sortM:S into monotonically decreasing order by weight w
		  for each  x ∈M.s,taken in monotonically decreasing order by weight w[x]
		  if( A∪{x}∈M.I)
		 	A = A ∪ {X}
		 return A;
	 } 
	 */
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

}
